Time hierarchies for cryptographic function inversion with advice
نویسندگان
چکیده
منابع مشابه
Time Hierarchies for Computations with a Bit of Advice
A polynomial time hierarchy for ZPTime with one bit of advice is proved. That is for any constants a and b such that 1 < a < b, ZPTime[n]/1 ( ZPTime[n]/1. The technique introduced in this paper is very general and gives the same hierarchy for NTime∩coNTime, UTime, MATime, AMTime and BQTime. It also significantly simplifies the previously known proofs of hierarchies for BPTime and RPTime with ad...
متن کاملHierarchies Against Sublinear Advice
We strengthen the non-deterministic time hierarchy theorem of [5,15,18] to show that the lower bound holds against sublinear advice. More formally, we show that for any constants c and d such that 1 6 c < d, there is a language in NTIME(n) which is not in NTIME(n)/n. The best known earlier separation [8] could only handle o(log(n)) bits of advice in the lower bound. We generalize our hierarchy ...
متن کاملA note on time hierarchies for reasonable semantic classes without advice
We show time hierarchies for reasonable semantic classes without advice by eliminating the constant bits of advice in previous results.The elimination is done by a contrapositive argument that for any reasonable computational model,let CTIME(f(n))/g(n) denote the set of all languages decide by machines running in time O(f(n)) with advice of g(n) bits in that model, if CTIME(t(n)) ⊆ CTIME(T (n))...
متن کاملThe Cryptographic Impact of Groups with Infeasible Inversion
Algebraic group structure is an important-and often overlooked-tool for constructing and comparing cryptographic applications. Our driving example is the open problem of finding provably secure transitive signature schemes for directed graphs, proposed by Micali and Rivest [41]. A directed transitive signature scheme (DTS) allows Alice to sign a subset of edges on a directed graph in such a way...
متن کاملHeuristic Time Hierarchies via Hierarchies for Sampling Distributions
We give a new simple proof of the time hierarchy theorem for heuristic BPP originally proved by Fortnow and Santhanam [FS04] and then simplified and improved by Pervyshev [Per07]. In the proof we use a hierarchy theorem for sampling distributions recently proved by Watson [Wat13]. As a byproduct we get that P 6⊆ BPTime[nk] if one way functions exist. As far as we know this statement was not kno...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Sciences
سال: 2009
ISSN: 1072-3374,1573-8795
DOI: 10.1007/s10958-009-9403-5